A Fast Method for Computing the Principal n th Roots of Complex Matrices*
نویسندگان
چکیده
Based on the generalized continued-fraction method for finding the nth roots of real numbers, this paper presents a fast computation method for finding the principal nth roots of complex matrices. Computation algorithms with high convergence rates are developed, and their global convergence properties are investigated from the viewpoint of systems theory.
منابع مشابه
Computation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملA STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملNotes on Fast Fourier Transform Algorithms & Data Structures 2004 ( updated 2007 )
In this set of lecture notes we focus on the point-value representation obtained by looking at a particular set of points, the nth roots of unity. In the field of complex numbers C, there are exactly n different solutions to the equation x = 1. We call these solutions the n-th roots of unity. One of these roots of unity is ωn = cos(2π/n)+ i sin(2π/n), and this is called the principal nth root o...
متن کاملNotes on Fast Fourier Transform Algorithms & Data Structures
In this set of lecture notes we focus on the point-value representation obtained by looking at a particular set of points, the nth roots of unity. In the field of complex numbers C, there are exactly n different solutions to the equation x = 1. We call these solutions the n-th roots of unity. One of these roots of unity is ωn = cos(2π/n)+ i sin(2π/n), and this is called the principal nth root o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001